MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { f(a(), X, X) -> f(X, b(), b())
  , b() -> a() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

Empty strict component of the problem is NOT empty.

Arrrr..